Listing All Potential Maximal Cliques of a Graph

نویسندگان

  • Vincent Bouchitté
  • Ioan Todinca
چکیده

A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum 5ll-in are polynomially tractable for these graphs. We show here that the potential maximal cliques of a graph can be generated in polynomial time in the number of minimal separators of the graph. Thus, the treewidth and the minimum 5ll-in are polynomially tractable for all classes of graphs with a polynomial number of minimal separators. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting and Listing all Potential Maximal Cliques of a Graph

We show that the number of potential maximal cliques for an arbitrary graph G on n vertices is O∗(1.8135n), and that all potential maximal cliques can be listed in O∗(1.8899n) time. As a consequence of this results, treewidth and minimum fill-in can be computed in O∗(1.8899n) time.

متن کامل

New algorithms for $k$-degenerate graphs

A graph is k-degenerate if any induced subgraph has a vertex of degree at most k. In this paper we prove new algorithms finding cliques and similar structures in these graphs. We design linear time Fixed-Parameter Tractable algorithms for induced and non induced bicliques. We prove an algorithm listing all maximal bicliques in time O(k(n−k)2), improving the result of [D. Eppstein, Arboricity an...

متن کامل

Comparison of Clique-Listing Algorithms

This paper compares several published algorithms which list all of the maximal cliques of a graph. A clique is a complete subgraph, i.e., a set of vertices and edges such that every pair of vertices is joined by an edge. A maximal clique is a clique which is not a proper subgraph of a larger clique. A closely related concept is that of a maximal independent set (MIS), where every pair of vertic...

متن کامل

Submission Track B : exact algorithm for Minimum Fill - In ( aka Chordal Completion )

Our implementation follows the exact algorithm of Fomin et al. [3] which is based on listing the minimal separators, the potential maximal cliques, and then performing dynamic programming based on those structures [1, 2]. The algorithm by Fomin et al. refines the approach of Bouchitté and Todinca on some minor aspects (only considering inclusion-minimal minimal separators, trying only the so-ca...

متن کامل

8 F eb 2 01 2 Cliques in Odd - Minor - Free Graphs ∗

This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an n-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 276  شماره 

صفحات  -

تاریخ انتشار 2000